Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling

In this work, we show how to garble arithmetic circuits with full active security in the general multiparty setting, secure full-threshold setting (that is, when only one party is assumed honest). Our solution allows interfacing Boolean garbled circuits. Previous works circuit domain focused on two-party or semi-honest and assuming an honest majority – notably, work of Ben-Efraim (Asiacrypt 2018) semi-honest, model, which adapt extend. As additional contribution, improve Ben-Efraim’s selector gate. A gate a that given two inputs binary input, outputs inputs, based value selection bit input. new construction for reduces communication cost almost half This result applies both model.